Frontiers of infinite trees
نویسندگان
چکیده
منابع مشابه
Excluding Infinite Trees
For each infinite cardinal k we give several necessary and sufficient conditions for a graph not to contain a minor isomorphic to the infinite kbranching tree in terms of a certain kind of a "tree-decomposition," in terms of a "path-decomposition," and also in terms of a "cops-and-robber game." We also give necessary and sufficient conditions for a graph not to contain a subgraph isomorphic to ...
متن کاملFundamental Properties of Infinite Trees
Abstrwt. Infinite trees naturally arise in the formaliration and the c~udy of fhc \cm;lntic*, 01 prog-amming languages. This paper investigates some of their i:omninatorial and :iIgcbri\ic propei ties that are especially relevant to semantics. This paper is concerned in particular with regtilar and algchraic itlfinitc trees, rlor ln.ith rzg\lI;lr or algebraic s4f.s of infinite trees. For this r...
متن کاملInfinite Trees and the Future
We study the problem of designing layout facilities for the navigation of an “infinite” graph, i.e. a graph that is so large that its visualization is unfeasible, even by gluing together all the screen snapshots that a user can take during the navigation. We propose a framework for designing layout facilities that support the navigation of an infinite tree. The framework allows to exploit the k...
متن کاملLinear Constraints over Infinite Trees
In this paper we consider linear arithmetic constraints over infinite trees whose nodes are labelled with nonnegative real numbers. These constraints arose in the context of resource inference for objectoriented programs but should be of independent interest. It is as yet open whether satisfiability of these constraint systems is at all decidable. For a restricted fragment motivated from the ap...
متن کاملDistributing Labels on Infinite Trees
Sturmian words are infinite binary words with many equivalent definitions: They have a minimal factor complexity among all aperiodic sequences; they are balanced sequences (the labels 0 and 1 are as evenly distributed as possible) and they can be constructed using a mechanical definition. All this properties make them good candidates for being extremal points in scheduling problems over two pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Informatique théorique
سال: 1978
ISSN: 0399-0540
DOI: 10.1051/ita/1978120403191